Polynomial Time Inductive Inference of Cograph Pattern Languages from Positive Data
نویسندگان
چکیده
A cograph is a graph which can be generated by disjoint union and complement operations on graphs, starting with a single vertex graph. Toward effective data mining for graph structured data, we introduce a graph pattern expression, called a cograph pattern, based on cographs. We show that the class of cograph pattern languages is polynomial time inductively inferable from positive data.
منابع مشابه
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
A pattern is a string of constant symbols and variables. The language de ned by a pattern p is the set of constant strings obtained from p by substituting nonempty constant strings for variables in p. In this paper we are concerning with polynomial time inference from positive data of the class of unions of a bounded number of pattern languages. We introduce a syntactic notion of minimal multip...
متن کاملA Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages
A tree pattern is a structured pattern known as a term in formal logic, and a tree pattern language is the set of trees which are the ground instances of a tree pattern. In this paper, we deal with the class of tree languages whose language is de ned as a union of at most k tree pattern languages, where k is an arbitrary xed positive number. In particular, we present a polynomial time algorithm...
متن کاملDevelopments from enquiries into the learnability of the pattern languages from positive data
The pattern languages are languages that are generated from patterns, and were first proposed by Angluin as a nontrivial class that is inferable from positive data [D. Angluin, Finding patterns common to a set of strings, Journal of Computer and System Sciences 21 (1980) 46–62; D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117–135]. In...
متن کاملPolynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data
Tree structured data such as HTML/XML files are represented by rooted trees with ordered children and edge labels. As a representation of a tree structured pattern in such tree structured data, we propose an ordered tree pattern, called a term tree, which is a rooted tree pattern consisting of ordered children and internal structured variables. A term tree is a generalization of standard tree p...
متن کاملcient Learning of One - Variable Pattern Languagesfrom Positive
A pattern is a nite string of constant and variable symbols. The language generated by a pattern is the set of all strings of constant symbols which can be obtained from the pattern by substituting non-empty strings for variables. Descriptive patterns are a key concept for inductive inference of pattern languages. A pattern is descriptive for a given sample if the sample is contained in the lan...
متن کامل